#include "BinaryTree.h"


void test()
{
    Tree* n1 =(Tree*) malloc(sizeof(Tree));
    n1->data = 'A';
    n1->left = NULL;
    n1->right = NULL;

    Tree* n2 =(Tree*) malloc(sizeof(Tree));
    n2->data = 'B';
    n2->left = NULL;
    n2->right = NULL;

    Tree* n3 =(Tree*) malloc(sizeof(Tree));
    n3->data = 'C';
    n3->left = NULL;
    n3->right = NULL;

    Tree* n4 =(Tree*) malloc(sizeof(Tree));
    n4->data = 'D';
    n4->left = NULL;
    n4->right = NULL;
    
    Tree* n5 =(Tree*) malloc(sizeof(Tree));
    n5->data = 'E';
    n5->left = NULL;
    n5->right = NULL;

    n1->left = n2;
    n1->right = n3;
    n2->left = n4;
    n4->left = n5;

    PrevOrder(n1);
    InOrder(n1);
}

int main()
{
    test();
    return 0;
}